Workflow Analysis using Graph Kernels
نویسندگان
چکیده
Workflow enacting systems are a popular technology in business and e-science alike to flexibly define and enact complex data processing tasks. Since the construction of a workflow for a specific task can become quite complex, efforts are currently underway to increase the re-use of workflows through the implementation of specialized workflow repositories. While existing methods to exploit the knowledge in these repositories usually consider workflows as an atomic entity, our work is based on the fact that workflows can naturally be viewed as graphs. Hence, in this paper we investigate the use of graph kernels for the problems of workflow discovery, workflow recommendation, and workflow pattern extraction, paying special attention on the typical situation of few labeled and many unlabeled workflows. To empirically demonstrate the feasibility of our approach we investigate a dataset of bioinformatics workflows retrieved from the website myexperiment.org.1
منابع مشابه
graphkernels: R and Python packages for graph comparison
Summary Measuring the similarity of graphs is a fundamental step in the analysis of graph-structured data, which is omnipresent in computational biology. Graph kernels have been proposed as a powerful and efficient approach to this problem of graph comparison. Here we provide graphkernels, the first R and Python graph kernel libraries including baseline kernels such as label histogram based ker...
متن کاملTermination of Workflows A snapshot-based approach
A workflow is a set of activities usually organized using a graph structure that has one beginning and one end. A workflow includes human participants and software applications that have the responsibility to carry out activities. A workflow is known to be the formal definition of the process used to manage business processes (e.g., sales order processing, article reviewing, member registration...
متن کاملWPS No . 621 / February 2008 Workflow Graph Verification Using Graph Search Techniques
Workflow management systems provide a flexible way of implementing business processes. Structural conflicts such as deadlock and lack of synchronization are commonly occurring errors in workflow processes. Workflows with structural conflicts may lead to error-prone and undesirable results in business processes, which may in turn affect customer satisfaction, employee productivity, and integrity...
متن کاملApplication of Kernels to Link Analysis: First Results
The application of kernel methods to link analysis is explored. We argue that a family of kernels on graphs provides a unified perspective on the three measures proposed for link analysis: relatedness, global importance, and relative importance. The framework provided by the kernels establishes relative importance as an intermediate between relatedness and global importance, in which the bias b...
متن کاملWeisfeiler-Lehman Graph Kernels
In this article, we propose a family of efficient kernels for large graphs with discrete node labels. Key to our method is a rapid feature extraction scheme based on the Weisfeiler-Lehman test of isomorphism on graphs. It maps the original graph to a sequence of graphs, whose node attributes capture topological and label information. A family of kernels can be defined based on this Weisfeiler-L...
متن کامل